Optimality Conditions and Dualities for Robust Efficient Solutions of Uncertain Set-Valued Optimization with Set-Order Relations
نویسندگان
چکیده
In this paper, we introduce a second-order strong subdifferential of set-valued maps, and discuss some properties, such as convexity, sum rule so on. By the new its establish necessary sufficient optimality condition set-based robust efficient solutions for uncertain optimization problem. We also Wolfe type dual problem Finally, weak duality theorem between Several main results extend to corresponding ones in literature.
منابع مشابه
Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization
Unfortunately, the incorrect version of [1, Theorem 4.3] was published. The correct version of [1, Theorem 4.3] is given in this paper. By employing the generalized higher-order contingent derivatives of set-valued maps, Wang et al. [1] established a sufficient optimality condition of weakly efficient solutions for (SV P): (SV P) min F(x), s.t. G(x) (−D) = ∅, x ∈ E. Theorem 1 (see [1, Theorem 4...
متن کاملFirst-order optimality conditions in set-valued optimization
A a set-valued optimization problem minC F (x), x ∈ X0, is considered, where X0 ⊂ X , X and Y are Banach spaces, F : X0 Y is a set-valued function and C ⊂ Y is a closed cone. The solutions of the set-valued problem are defined as pairs (x, y), y ∈ F (x), and are called minimizers. In particular the notions ofw-minimizer (weakly efficient points), p-minimizer (properly efficient points) and i-mi...
متن کاملOptimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems
In this paper, we present a new approach to the study of various efficient solutions of a set-valued equilibrium problem (for short, SEP) through the study of corresponding solutions of a set-valued optimization problem with a geometric constraint (for short, SOP). The solutions under consideration are: efficient solutions, weakly efficient solutions, strongly efficient solutions, and properly ...
متن کاملOptimality Conditions for Vector Optimization with Set-Valued Maps
In this paper, we establish a Farkas-Minkowski type alternative theorem under the supposition of nearly semiconvexlike set-valued maps. Based on the alternative theorem and some other lemmas, we present necessary optimality conditions and sufficient optimality conditions for set-valued vector optimization problems with extended inequality constraints in a sense of weak E-minimizers.
متن کاملOn -optimality Conditions for Convex Set-valued Optimization Problems
In this paper, -subgradients for convex set-valued maps are defined. We prove an existence theorem for -subgradients of convex set-valued maps. Also, we give necessary optimality conditions for an -solution of a convex set-valued optimization problem (CSP). Moreover, using the single-valued function induced from the set-valued map, we obtain theorems describing the -subgradient sum formula for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Axioms
سال: 2022
ISSN: ['2075-1680']
DOI: https://doi.org/10.3390/axioms11110648